Random walks and electric networks
نویسندگان
چکیده
∗Copyright (C) 1999, 2000, 2006 Peter G. Doyle and J. Laurie Snell. Derived from their Carus Monograph, Copyright (C) 1984 The Mathematical Association of America. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, as published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
منابع مشابه
Electric Networks and Commute Time
The equivalence of random walks on weighted graphs with reversible Markov chains has long been known. Another such correspondence exists between electric networks and these random walks. Results in the language of random walks have analogues in the language of electric networks and visa versa. We outline this correspondence and describe how to translate several of the major terms of electric ne...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملRandom Walk on Periodic Trees
Following Lyons (1990, [4]) we define a periodic tree, restate its branching number and consider a biased random walk on it. In the case of a transient walk, we describe the walk-invariant random periodic tree and calculate the asymptotic rate of escape (speed) of the walk. This is achieved by exploiting the connections between random walks and electric networks.
متن کاملRandom Walks on Infinite Graphs and Groups — a Survey on Selected Topics
Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks on graphs 6 E. Harmonic and superharmonic functions 6 3. Spectral radius, amenability and law of large numbers 6 A. Spectral radius, isoperimetric inequalities and growth 6 B. Law of large numbers 9 ...
متن کاملRandom Walks between Leaves of Random Networks
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdős-Rényi random graphs and Barabási-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk. One approach is to label nodes according to both their to...
متن کاملNon-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کامل